Complexity and Sophistication∗
نویسندگان
چکیده
Complexity may overwhelm sound decision-making, which has motivated the development of simple alternatives to solving complex financial problems. Evidence is lacking, however, on whether people who struggle with complexity are sophisticated and know when they are better off opting out. We tested the effects of complexity on financial choices in a large and diverse sample of Americans, and evaluated the sophistication of their opting out decisions. With a novel method, we randomly assigned complexity to portfolio problems. In a second treatment, we offered a simple option as an alternative to making a portfolio choice. Complexity leads those with lower skills to more often take the simple option and, as a result, earn lower returns and make more dominated choices. Structural estimates of a rational inattention model indicate that these decisions to opt out are, nevertheless, sophisticated; they are a response the higher costs of optimizing in complex settings. ∗This paper benefited from many discussions with Shachar Kariv, and participants in several seminars and conferences. Special thanks to Alisdair McKay, Andrew Caplin, Juan Carillo, Mark Dean, Alex Rees-Jones, and Jeremy Tobacman for their thoughtful comments, and to Carla Blair, Tania Gutsche, Adrian Montero, Bart Oriens, and Bas Weerman for their integral work on implementing the experiment. Francesco Agostinelli provided exemplary research assistance. This work was funded by the National Institute on Aging (NIA P30AG024962) through USC’s Roybal Center for Financial Decision Making. †Carvalho: University of Southern California ([email protected]) Silverman: Arizona State University and NBER ([email protected]).
منابع مشابه
The Relationship between Syntactic and Lexical Complexity in Speech Monologues of EFL Learners
: This study aims to explore the relationship between syntactic and lexical complexity and also the relationship between different aspects of lexical complexity. To this end, speech monologs of 35 Iranian high-intermediate learners of English on three different tasks (i.e. argumentation, description, and narration) were analyzed for correlations between one measure of sy...
متن کاملM-sophistication
The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded by the m-sophistication of x within small additive terms. This shows that m-sophistication is lower bounded by coarse sophistication and upper bounded by soph...
متن کاملInformation measures for infinite sequences
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defined the sophistication of an object as the length of the shortest total program that given some data as input produces it and the sum of the size of the program with the size of the data is as consice as the smallest de...
متن کاملThe Relationship Between ‘Higher Education and Training’ and ‘Business Sophistication’
Economics of education which investigates economic issues related to education - presents a framework which leads to better schedules and policy-making. On the other hand, the concept of competitiveness has drawn increasing attention of both scholars and governors in the past decade. The World Economic Forum (WEF) has published Global Competitiveness Index (GCI) in order to measure national com...
متن کاملSophisticated Infinite Sequences
In this paper we revisit the notion of sophistication for infinite sequences. Koppel defined sophistication of an object as the length of the shortest (finite) total program (p) that with some (finite or infinite) data (d) produce it and |p|+ |d| is smaller than the shortest description of the object plus a constant. However the notion of “description of infinite sequences” is not appropriately...
متن کاملThe Limits of Decidable States on Open-Ended Evolution and Emergence
Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical systems. Within this framework, we show that decidability imposes absolute limits to the stable growth of complexity in computable dynamical systems. Conversely, ...
متن کامل